Continuous time programming with nonlinear constraints
نویسندگان
چکیده
منابع مشابه
An efficient modified neural network for solving nonlinear programming problems with hybrid constraints
This paper presents the optimization techniques for solving convex programming problems with hybrid constraints. According to the saddle point theorem, optimization theory, convex analysis theory, Lyapunov stability theory and LaSalleinvariance principle, a neural network model is constructed. The equilibrium point of the proposed model is proved to be equivalent to the optima...
متن کاملFully fuzzy linear programming with inequality constraints
Fuzzy linear programming problem occur in many elds such as mathematical modeling, Control theory and Management sciences, etc. In this paper we focus on a kind of Linear Programming with fuzzy numbers and variables namely Fully Fuzzy Linear Programming (FFLP) problem, in which the constraints are in inequality forms. Then a new method is proposed to ne the fuzzy solution for solving (FFLP). Nu...
متن کاملNonlinear programming advances in mathematical programming with complementarity constraints
Given a suitably parameterised family of equilibrium models and a higher level criterion by which to measure an equilibrium state, mathematical programs with equilibrium constraints (MPECs) provide a framework for selecting good or even optimal parameters. An example is toll design in traffic networks, which attempts to reduce total travel time by choosing which arcs to toll and what toll level...
متن کاملLinear time-dependent constraints programming with MSVL
This paper investigates specifying and solving linear time-dependent constraints with an interval temporal logic programming language MSVL. To this end, linear constraint statements involving linear equality and non-strict inequality are first defined. Further, the time-dependent relations in the constraints are specified by temporal operators, such as ©, ©,prj, ; , . Thus, linear time-dependen...
متن کاملNewton - Constraint Programming over Nonlinear Constraints
This paper is an introduction to Newton, a constraint programming language over nonlinear real constraints. Newton originates from an effort to reconcile the declarative nature of constraint logic programming (CLP) languages over intervals with advanced interval tcchniqucs dcvclopcd in numerical analysis, such as the interval Newton method. Its key conceptual idea is to introduce the notion of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1974
ISSN: 0022-247X
DOI: 10.1016/0022-247x(74)90124-3